Minimum stable convergence criteria for Stochastic Diffusion Search

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Stable Convergence Criteria for Stochastic Diffusion Search

This letter presents an analysis of Stochastic Diffusion Search that derives the minimum acceptable match resulting in a stable convergence based on a general noise parameter. The applicability of SDS can therefore be assessed for a given problem.

متن کامل

Convergence Analysis of Stochastic Diffusion Search

In this paper we present a connectionist searching techniquethe Stochastic Diffusion Search (SDS), capable of rapidly locating a specified pattern in a noisy search space. In operation SDS finds the position of the prespecified pattern or if it does not exist its best instantiation in the search space. This is achieved via parallel exploration of the whole search space by an ensemble of agents ...

متن کامل

Stochastic Diffusion Search Review

Stochastic Diffusion Search (SDS), first incepted in 1989, belongs to the extended family of Swarm Intelligence algorithms. In contrast to many nature-inspired algorithms, SDS has a strong mathematical framework describing its behaviour and convergence. In addition to concisely exploring the algorithm in the context of natural swarm intelligence systems, this paper reviews the developments of t...

متن کامل

Constrained Stochastic Diffusion Search

This paper describes the development of an extension of a best-fit string-matching algorithm, Stochastic Diffusion Search. The extension described allows the identification of best-fit sequences; that may include gaps between contiguous sub-strings of a target. The algorithm is applied in the field of computational molecular biology, and initial progress into this application is given.

متن کامل

Foundations of stochastic diffusion search

Stochastic Diffusion Search (sds) was introduced by Bishop (1989a) as an algorithm to solve pattern matching problems. It relies on many concurrent partial evaluations of candidate solutions by a population of agents and communication between those agents to locate the optimal match to a target pattern in a search space. In subsequent research, several variations on the original algorithmic for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics Letters

سال: 2004

ISSN: 0013-5194

DOI: 10.1049/el:20040096